On Continuous Cost Sharing Solutions for Minimum Cost Spanning Tree Problems
نویسنده
چکیده
A review of continuous cost sharing solutions for the minimum cost spanning tree problem is proposed, with a particular focus on the folk and Kar solutions. We compare the characterizations proposed, helped by some new results on equivalencies between sets of properties.
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملCharacterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
Minimum cost spanning tree problems connect agents e¢ ciently to a source when agents are located at di¤erent points and the cost of using an edge is xed. The folk and cycle-complete cost sharing solutions always o¤er core allocations. We provide similar characterizations for both. A new property is based on the following observation: when all agents have the same cost to connect to the source...
متن کاملA fair rule in minimum cost spanning tree problems Gustavo Bergantiños and Juan J . Vidal - Puga 06 - 05
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties.
متن کاملA fair rule in minimum cost spanning tree problems
We study minimum cost spanning tree problems and de ne a cost sharing rule that satis es many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties. Keywords: Spanning tree. Cost allocation. Monotonicity. JEL Classi cation Numbers: C71, D63, D7.
متن کاملHierarchies to Solve Constrained Connected Spanning Problems
Given a graph and a set of vertices, searching for a connected and minimum cost structure which spans the vertices is a classic problem. When no constraints are applied, the minimum cost spanning structure is a sub-graph corresponding to a tree. If all the vertices in the graph should be spanned the problem is referred to as minimum spanning tree (MST) construction and polynomial time algorithm...
متن کامل